Adaptive receiver in a non-orthogonal multiple access (noma) communication systems

ABSTRACT

An adaptive receiver for UEs using NOMA-based schemes. One objective is to improve the achievable rate of the weak UE and improve the fairness among the grouped UEs. At the same time, an embodiment gives the chance to reduce the error probability of the strong UE. Thus, compared to conventional NOMA, an embodiment increases the network sum throughput.

TECHNICAL FIELD

Disclosed are embodiments related to non-orthogonal multiple access(NOMA) communication systems.

BACKGROUND

The design of multiple access schemes is of interest in the design ofcellular telecommunication systems. The goal of multiple access schemesis to provide multiple user equipments (UEs) (i.e., wirelesscommunication devices, such as, for example, smartphones, tablets,phablets, smart sensors, wireless Internet-of-Things (IoT) devices,etc., that are capable of wirelessly communicating with an access point)with radio resources in a spectrum, cost, and complexity-efficientmanner. 1G-3G wireless communication systems, frequency divisionmultiple access (FDMA), time division multiple access (TDMA) andfrequency^(,) division multiple access (CDMA) schemes have beenintroduced. Long-Term Evolution (LTE) and LTE-Advanced employ orthogonalfrequency division multiple access (OFDMA) and single-carrier (SC)-FDMAas orthogonal multiple access (OMA) schemes. Such orthogonal designshave the benefit that there is no mutual interference among UEs, leadingto high system performance with simple receivers.

Recently, non-orthogonal multiple access (NOMA) has receivedconsiderable attention as a promising multiple access technique for LTEand 5G systems. With NOMA, two or more UEs may share the same radioresources (e.g., time resources, frequency resources, and/or coderesources). Particularly, 3GPP has considered NOMA in differentapplications. For instance, NOMA has been introduced as an extension ofthe network-assisted interference cancellation and suppression (NAICS)for intercell interference (ICI) mitigation in LTE Release 12 as well asa study item of LTE Release 13, under the name of “Downlink multiusersuperposition transmission.” Also, in recent 3GPP meetings, it isdecided that new radio (NR) should target to support (at least) uplinkNOMA, in addition to the OMA approach.

SUMMARY

NOMA exploits channel difference between or among UEs to improvespectrum efficiency. Generally, the highest gain of NOMA is observed inthe cases where a “strong” UE (i.e., a UE experiencing a good channelcondition with a base station, such as, for example, a UE located in thecenter of a cell) and a “weak” UE (i.e., a UE having a poor channelcondition with the base station, such as, for example, a UE located ator near a cell edge) are grouped (i.e., use the same radio resources).However, the implementation of NOMA implies: 1) use of more advanced andcomplex receivers to enable multi-user signal separation, 2) moredifficult synchronization, and 3) a higher signal decoding delay

For example, considering downlink NOMA, the strong UE typically usessuccessive interference cancellation (SIC) to first decode and removethe signal of the weak UE and then decode its own signalinterference-free. As a result, compared to conventional OMA scheme,NOMA-based data transmission leads to higher receiver complexity. Also,compared to OMA-based systems, the two-step decoding process of thestrong UE may lead to larger end-to-end transmission delay for thestrong UE, as well as for the weak UE (e.g. in scenarios in which theirsignals should be synchronized). Also, there is a probability that thestrong UE cannot correctly decode the message of the weak UE affectingthe successful decoding probability of its own message.

Also, while using NOMA outperforms OMA in terms of sum rate, the sumrate gain of NOMA is at the cost possible rate loss for the weak UE(e.g., the cell-edge UE). This is because, with downlink NOMA, the weakUE considers the signal of the strong UE as interference and uses thetypical OMA-based decoder to decode its own message. Thus, depending onthe interference power, there is a probability that NOMA-basedtransmission leads to lower achievable rates for the weak UE, comparedto the cases using OMA. Also, there may be unfair resource allocationbetween the weak and the strong UEs.

In one embodiment, this disclosure describes an adaptive receiver forthe weak UEs using NOMA-based schemes. The objective is to improve theachievable rate of the weak UE and improve the fairness among thegrouped UEs. At the same time, the proposed scheme gives the chance toreduce the error probability of the strong UE. Thus, compared toconventional NOMA., the proposed scheme increases the network sumthroughput. In the proposed scheme, depending on the message decodingstatus of the strong UE, different decoding schemes may be considered bythe weak UE such that it can remove the interfering signal of the strongUE and, thereby, improve its own achievable rate. Compared to theconventional NOMA techniques, the proposed scheme increases thethroughput of the weak UEs and improves the fairness among the groupedUEs. Moreover, the proposed scheme makes it possible to improve theperformance of the strong UE and, consequently, increase the network sumthroughput.

In another embodiment, this disclosure describes an adaptive receiverfor the strong UEs using hybrid automatic repeat request (HARQ) inNOMA-based networks. The objective is to reduce the implementationcomplexity, the decoding delay, and the probability of error propagationfor the strong UEs. At the same time, the proposed scheme reduces theend-to-end transmission delay of the weak UEs as well. In the proposedsetup, depending on the message decoding status of the weak UE,different decoding schemes may be considered by the strong UE. Then,depending on the selected decoding scheme, the network node (NN) cansynchronize the signals of the UEs correspondingly. Compared to theconventional NOMA techniques, the proposed scheme reduces the receivercomplexity of the strong UE considerably. Also, the proposed schemereduces the end-to-end transmission delay of the network as well as theerror propagation at the strong UE.

Accordingly, in aspect there is provided method performed by a networknode serving a first UE and a second UE. The method includes the networknode transmitting, during a first time slot (t1), a first superimposedsignal (S(t1)) comprising a first message for the first UE and a secondmessage for the second UE. The method also includes the network nodereceiving a message transmitted by the first UE indicating that thefirst UE was unable to decode the first message. The method furtherincludes, after receiving the message transmitted by the first UEindicating that the first UE was unable to decode the first message, thenetwork node providing to the second UE a message indicating that thefirst UE was unable to decode the first message, thereby enabling thesecond UE to select an appropriate decoding scheme to use in asubsequent time slot.

In some embodiments, the method further includes, after receiving themessage transmitted by the first UE indicating that the first UE wasunable to decode the first message, the network node transmitting,during a second time slot (t2), a second superimposed signal (S(t2))comprising the first message for the first UE and a third message forthe second UE.

In some embodiments, the method further includes, the network nodetransmitting, during a third time slot, a third superimposed signalcomprising a third message for the first UE and a fourth message for thesecond UE; the network node receiving a message transmitted by thesecond UE indicating that the second UE was unable to decode the fourthmessage for the second UE included in the third superimposed signal; andafter receiving the message transmitted by the second. UE indicatingthat the second UE was unable to decode the fourth message, the networknode providing to the first UE a message indicating that the networknode will retransmit in a fourth time slot at least a portion of thefourth message. In some embodiments, the method also includes, afterreceiving the message transmitted by the second UE indicating that thesecond UE was unable to decode the fourth message, the network nodetransmitting, during the fourth time slot, a fourth superimposed signalcomprising the fourth message for the second UE and a fifth message forthe first UE.

In another aspect there is provided a method performed by a first UEthat is being served by a network node. The method includes the first UEreceiving, during a first time slot, a first superimposed signal, thefirst superimposed signal comprising a first message for the first UEand a. second message for a second UE being served by the network node.The method also includes, after receiving the first superimposed signal,the first UE obtains information that indicates that the second UE wasunable to decode the second message and uses the obtained. informationto decode a third message for the first UE that is contained in a secondsuperimposed signal received by the first UE.

In some embodiments, obtaining the information comprises the first UEreceiving a message transmitted by the network node, wherein the messageindicates that the second UE was unable to decode the second message. Inother embodiments, obtaining the information comprises the first UEreceiving a negative acknowledgement transmitted by the second UE.

In some embodiments, the method further includes: the first UE decodingthe first superimposed signal to obtain from the first superimposedsignal the first message for the first UE; the first UE using theobtained first message and the first superimposed signal to generate a.residual signal comprising the second message for the second UE; and thefirst UE buffering the residual signal. In some embodiments, the methodfurther includes the first UE receiving, during a second time slot, asecond superimposed signal, the second superimposed signal comprising athird message for the first UE and at least a portion of the secondmessage; the first UE using the buffered residual signal and thereceived second superimposed signal to obtain said at least a portion ofthe second message. In some embodiment, the method also includes thefirst UE using the obtained second message and the received secondsuperimposed signal to obtain the third message from the secondsuperimposed signal.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated herein and form partof the specification, illustrate various embodiments.

FIG. 1 illustrates a network node communicating simultaneously with afirst UE and a second UE.

FIG. 2 illustrates processing that occurs during a time slot.

FIG. 3 illustrates processing, according to one embodiment, that occursduring first and second time slots.

FIG. 4 illustrates processing, according to another embodiment, thatoccurs during first and second time slots.

FIG. 5 is a flow chart illustrating a process according to oneembodiment.

FIG. 6 is a flow chart illustrating a process according to oneembodiment.

FIG. 7 is a block diagram of a network node according to one embodiment.

FIG. 8 is a diagram showing functional units of a network node accordingto one embodiment.

FIG. 9 is a block diagram of a UE according to one embodiment.

FIG. 10 is a diagram functional units of a UE according to oneembodiment.

FIG. 11 is a diagram showing functional units of a UE according to oneembodiment.

DETAILED DESCRIPTION

FIG. 1 illustrates a network 100 having a network node (NN) 105 (e.g., asystem comprising a 4G or 5G base station) other access point) servingtwo UEs: UE 101 and UE 102. The two UEs have different channel (or“link”) qualities. In this scenario, UE 102 is a “weak” UE (e.g., acell-edge UE) and UE 101 is a “strong” UE (e.g. a cell-center UE).

With respect to uplink OMA transmissions, the UE 101's and UE 102'ssignals are transmitted in orthogonal resources. for instance at thesame time but in different frequency bands, and the NN 105 decodes thetwo transmitted signals separately. With respect to downlink OMAtransmissions, the NN 105 transmits for UE 101 a first signal using forexample a first frequency band and transmits for UE 102 a second signalusing for example a second frequency band that does not overlap with thefirst frequency band.

With respect to uplink NOMA, on the other hand, the UEs share the samefrequency (or “spectrum”), time resources, and code or spreadingresources, if any, to send their messages simultaneously. In such a NOMAscenario, the NN, using for example a SIC receiver, first decodes themessage of UE 101 (the “strong” UE), considering the signal of UE 102 asnoise. Then, after successfully decoding UE 101's signal, the NNsubtracts UE 101's signal from the received signal and decodes UE 102'ssignal with no interference from UE 101.

Likewise, with respect to downlink NOMA, UE 101 and UE 102 are served bythe NN in common spectrum resource blocks, i.e., time-frequency chunks.We shall consider a frequency slot so that the time-frequency chunksrefer to different time slots. Then, with no loss of generality, supposethat UE 101 experiences a better channel quality compared to UE 102(i.e., UE 101 is the strong UE and UE 102 is the weak UE). That is, wehave |h₂|≤|h₁|, where h₁ represents the channel coefficient of the NN-UE101 link and h₂ represents the channel coefficient of the NN-UE 102link. We define the channel gains as g₁=|h_(i)|², i=1,2.

Using NOMA, in time slot t the NN generates and transmits a superimposedsignal S(t)√{square root over (P₁)}X₁(t)+√{square root over (P₂)}X₂(t)to both UEs in the same resources. Here, X₁(t) and X₂ (t) are theunit-variance messages for UE 101 and UE 102, respectively, and P₁, i=1,2, are their corresponding transmit powers with P₁+P₂=P where P is theNN total power. In this way, the signal received by UE 101 (i.e., Y₁(t))and the signal received by UE 102 (i.e., Y₂(t)) is given by:

Y _(i)(t)=h _(i)(√{square root over (P₁)}X ₁(t))+√{square root over(P₂)}X ₂(t))+Z _(i)(t), i=1, 2,   (1)

where

-   Z₁(t) denotes a noise signal (e.g., Gaussian white noise).

In the above scenario, which is illustrated in FIG. 2, UE 101 uses a SICreceiver to first decode-and-remove the message of UE 102 (i.e., X₂) andthen obtain its own message (X₁) with no interference. The UE with theworse channel quality, i.e., UE 102 uses typical decoders to decode itsown message in the presence of interference of the signal for UE 101.

The goal of each UE is to decode its own message, although they maydecode the message of the other UE to reduce the interference. Withconventional NOMA, UE 102 considers the signal for UE 101 asinterference and uses OMA-based receivers to decode its own message.This is because it can be theoretically shown that there is no chancethat UE 102 can first decode-and-remove the message of UE 101 (and then,decode its own message interference-free). UE 101, on the other hand,uses a SIC receiver to first decode-and-remove the message of UE 102 andthen decode its own message interference-free.

Compared to conventional OMA-based receivers, SIC is a high-complexityscheme. Also, because the desired signal is decoded in two steps, SICimplies larger decoding delay which affects, e.g., the HARQ feedbackprocess and, thereby, may increase the end-to-end transmission delay forboth UEs in the situations where UE 102's signal should be synchronizedwith the signal of the UE 101 (different methods can be applied tosynchronize the signals for instance, some sleeping period may beconsidered by UE 102 (as illustrated in FIG. 2) or the NN maysynchronize the signals of the UEs). Finally, with SIC, there is aprobability of error propagation. This is because, if the message of UE102 is not correctly decoded in the first step, the interference is notremoved which reduces the probability that the cell-center cansuccessfully decode its own message.

With this setup, the achievable rate for UE 101 (i.e., R₁) and theachievable rate for UE 102 (i.e., R₂) is given by:

$\begin{matrix}\{ {\begin{matrix}{{R_{1} = {\log_{2}( {1 + {P_{1}g_{1}}} )}},} \\{R_{2} = {\log_{2}( {1 + \frac{P_{2}g_{2}}{1 + {P_{1}g_{2}}}} )}}\end{matrix}.}  & (2)\end{matrix}$

From (2), it can be seen that, depending on the received interferencepower term P₁g₂, UE 102 may suffer from low transmission rates. Also,note that, with the message of UE 102 added as an interference, UE 101suffers from error propagation effect. Particularly, there is aprobability that UE 101 can not successfully remove the interferencesignal affecting the probability that it can decode its own messagecorrectly. Thus, there is reasonably high probability that UE 101 cannot decode its own message correctly, and it may need retransmissions.

Accordingly, it would be useful to develop a first adaptive decodingscheme where hybrid automatic repeat request (HARQ)-based signals areused to decode the interference seen by UE 102 before UE 102 decodes itsmessage of interest (in this way, removing the interference allows theNN to serve UE 102 with higher rates), and it would also be useful todevelop an adaptive decoding scheme where SIC is used only when it isrequired.

In the following descriptions, UE 101 is referred to as UE₁ and UE 102is referred to as UE₂.

A. The Adaptive Decoding Scheme for the Weak UE (UE₂)

Consider two successive time slots t and 17 (also referred to as t1 andt2), as illustrated in FIG. 3. In the proposed setup, UE₁ uses the sameSIC-based decoding scheme as in conventional NOMA. However, depending onthe UE₁'s message decoding status, different decoding schemes may beconsidered by UE₂ in subsequent time slots (e.g. slot t). For simplicityof presentation, assume that, in Slot t, UE₁ has not decoded its ownmessage X₁(t) correctly, independently of whether or not it can decodeX₂(t). Also assume that UE₂ has correctly decoded its own message X₂(t)but, of course, it can not decode X ₁(y) correctly. However, the methodpresented below is applicable for other message decoding conditions atUE₁ and UE₂ as long as UE₁ can not decode X₁(t) and needs aretransmission.

In slot t, UE₂ first decodes its own message in the presence ofinterference and then, removes its own message, i.e., h₂√{square rootover (P₂)}X₂(t) in (1), from the received signal Y₂(t), therebyproducing a residual received signal, i.e., {tilde over(Y)}₂(t)=h₂√{square root over (P₁)}X₁(t)+Z₂(t) (note that, given thatUE₁ has not correctly decoded X₁(t) and with |h₁|≤|h₂|, UE₂ has nochance to correctly decode X₁(t) in slot t). UE₂ then buffers theresidual signal. The residual signal gives UE₂ the chance todecode-and-remove the interference of UE₁ in the next time slot (i.e.,slot t).

For instance, in slot t when the NN retransmits message X₁(t) (i.e., themessage for UE₁ that UE₁ was not able to decode in time slot t), UE₂uses the buffer residual signal (i.e., {tilde over (Y)}(t)=h₂√{squareroot over (P₁)}X₁(t)+Z₂(t)) and the signal received in time slot t(i.e., Y₂(t)=h₂(√{square root over (P₁)}X₁(t)+√{square root over(P₂)}X₂(t))+Z_(i)(t), with X₁(t)=X₁(t)), to first combine the two copiesof the UE₁ signal and decode-and-remove it from Y₂(t). Then, UE₂ decodesX₂(t) interference-free. This is because with two copies of the UE₁'smessage, UE₂ has the chance to decode the interference.

In the example, above Chase combining HARQ was used (i.e., X₁(t)=X₁(t)).In such cases. UE, can use a maximum ratio combining receiver to decodeX₁(t) from combining Y₂)(t) and {tilde over (Y)}₂(t). However, the samesetup is applicable for HARQ protocols other than Chase combining HARQ,such as, Incremental Redundancy HARQ, and UE₂ need only use theappropriate receiver depending on the selected HARQ protocol. Insummary, we can use the standard OMA-based receiver to decode X₁(t) andthen. based on the SIC receiver concept, remove this signal to have aninterference-free signal for UE₂.

Because UE₂ may experience an interference-free condition in slot t, itis possible for the NN to adapt the transmission parameters for thattime slot. Particularly, in slot t a higher data rate may be consideredfor UE₂ which leads to better fairness between UE₁ and UE₂. As analternative method, the NN may reduce the transmit power for the UE₂message which, with a sum power constraint P₁+P₂=P, increases thetransmit power for UE₁ message and, consequently, increases itssuccessful message decoding probability. That is, depending on thenetwork designer's point of interest, our proposed scheme can give thechance to reduce the error probability for UE₁

The above process continues until UE₁ correctly decodes its message orthe maximum number of retransmission rounds is reached. in any round, ifUE₂ has correctly decoded the message of UE₁ while UE₁ has still notdecoded its message, the interference signal can be easily removed byUE₂ with no decoding process. Thus, UE₂ can be provided with high datarates. Also, in any round, if UE₂ can not correctly decode the messageof UE₁, it decodes-and-removes its own message and buffers the residualsignal containing the message of UE₁ for possible use in the nextrounds. The key to enable such adaptive decoding scheme at UE₂ is forUE₂ to be aware that NN is retransmitting the message for UE₁ (e.g., UE₂being aware of the message decoding status of UE₁). In some embodiments,the NN provides UE₂ with this information. In other embodiments, UE₂monitors the acknowledgements sent by UE₁ so that UE₂ will know when UE₁has sent a negative acknowledgment (NACK), and, thereby know that the NNwill then retransmit the message to UE₁.

To summarize, in one embodiment, the following steps may be performed:

Step 1: The NN, using a NOMA transmission scheme, transmits in a firsttime slot (denoted slot t1 here and denoted t above) a first signalS_(t1), which contains a message for UE₁ (denoted X₁) and a message forUE₂ (denoted X₂);

Step 2: UE₁ receives signal Y₁(t1) corresponding to S_(t1) (see equation(1)), UE₂ receives signal Y₂(t1) corresponding to S_(t1), UE₁ attemptsto decode X₁ from Y₁(t1), and UE₂ attempts to decode X₂ from Y₂(t1).Assuming UE₁ was not able to decode X₁, UE₁ transmits a NACK (see block302 in FIG. 3) so that NN will transmit in a following time slot (t2)(also referred to as t) a second signal S_(t2) that contains X₁ and amessage for UE₂ (denoted X₃, which may be identical to X₂ or a newmessage that is different than X₂). Also, as described above, assumingUE₂ was able to successfully decode X₂, UE₂ generates the residualsignal, as described above, and buffers the residual signal (see block304 in FIG. 3). To synchronize the UEs' signals, some delay may beconsidered by UE₂, shown by the “sleep” box 306 in FIG. 3 (alternativelythe network may be the synchronization).

Step 3: The NN receives the HACK transmitted by UE₁. The NN alsoreceives the acknowledgement sent by UE₂, which in this case we canassume is a positive acknowledgement (ACK).

Step 4: The NN informs UE₂ that in time slot t2 NN will transmit asignal (S_(T2)) comprising message X₃ and message X₁ (i.e., the messagefor UE₁ that UE₁ was not able to decode). The NN may also inform UE₁ ofUE₂'s decoding status (e.g., in this case NN informs UE₁ that UE₂ wasable to decode X₂).

Step 5: in time slot t2 NN transmits S_(t2). Also, as described above,depending on the UEs message decoding status, the NN adapts thetransmission parameters, e.g., rate and/or power, of the UEs. Forinstance, the power used to transmit message X₁ in time slot t2 may begreater than the power that was used to transmit message X₁ in time slot1 and/or the rate used to transmit message X₃ in time slot t2 may begreater than the rate used to transmit message X₂ in time slot t1 (i.e.,message X₃ contains more information than message X₂).

Step 6: UE₂ receives signal Y₂(t2) corresponding to S_(t2) and UE₂ firsttries to decode X₁ from signal Y₂(t2) using the buffered residualsignal(s). If UE₂ is successful in decoding X₁ from signal Y₂(t2), thenUE₂ can remove X₁ from signal Y₂(t2), thereby allowing UE₂ to decodemessage X₃ from signal Y₂(t2). That is, in each round, UE₂ tries todecode the message of UE₁ based on A interfering signals accumulated indifferent rounds. If UE₂ is not successful to decode the message of UE₁,it buffers the signals for possible uses in the next rounds. If it candecode the message of UE₁ correctly, it removes the message of UE₁ anddecodes its own message interference-free.

The method above is described using Chase Combining HARQ, where the samesignal is sent to UE₁ in different retransmission rounds; however, asdescribed above, the same setup is well applicable for, e.g.,incremental redundancy HARQ, where different redundancy signals are sentin different retransmission rounds. For every type of HARQ, UE₂ uses thestandard decoding schemes to decode the message of UE₁ based on thesignals accumulated in different rounds. Further, the above descriptionassumes that the channel coefficients remain constant in different timeslots; however the same approach is applicable in the cases withdifferent values of channel coefficients in successive rounds.

B. The Adaptive Decoding Scheme for the Strong UE (UE₁)

In this embodiment, which is illustrated in FIG. 4, UE₁ utilizes theacknowledge/negative acknowledgement (ACK/NACK) signals of UE₂ to decidewhich receiver it will use. Consider two successive time slots, t1 andt2. Using the above example where the NN transmits S_(t1) in time slott1, there is reasonably high probability that the UE₂ cannot correctlydecode from S_(t1) message X₂ because message X₁, which is alsocontained in S_(t); appears as interference as well as because of thepoor channel condition between UE₂ and the NN. Thus, NN may need toretransmit X₂ in timeslot t2.

UE₁, on the other hand, can use SIC to correctly decode from S_(t1) bothmessages X₁ and X₂ with high probability, as UE₁ experiences highchannel quality. Then, in slot t2, when the NN retransmits the samemessage for the UE₂ (i.e., X₂) by transmitting signal S_(t2) containinga message for UE1 (denoted X₃) as well as X2, the UE₁ already has thedecoded the message of the UE₂ (i.e., X₂). Thus, the UE₁ removes X₂ fromY₁(t2), with no decoding process, and UE₁ decodes its owninterference-free message (X₃) with conventional decoders.

In this way, the decoding complexity/delay and the error propagationprobability is reduced, and the NOMA-based setup works in the same wayas OMA-based systems. This process continues until the UE₂ correctlydecodes its message or the maximum number of retransmission rounds isreached. The key to enable such adaptive decoding scheme at the UE₁ isto know about the message decoding status, i.e., ACK/NACK feedbacksignals, of the UE₂. In some embodiment, the NN provides the UE₁ withthis information or UE₁ obtains it itself. Finally, because the decodingdelay of SIC and conventional receivers are different, both UEssynchronize their signals based on the decoding scheme of the UE₁.

To summarize, in one embodiment, the following steps may be performed:

Step 1: The NN, using a NOMA transmission scheme, transmits in time slott1 a first signal S_(t1), which contains a message for UE₁ (denoted X₁)and a message for UE₂ (denoted X₂);

Step 2: UE₁ receives signal Y₁(t1) corresponding to S_(t1) (see equation(1)), UE₂ receives signal Y₂(t1) corresponding to S_(a), UE₁ attempts todecode X₁ from Y₁(t1), and UE₂ attempts to decode X₂ from Y₂(t1).Assuming UE₂ was not able to decode X₂, UE₂ transmits a NACK (see block402 in FIG. 4), which, in this example, causes NN to transmit in afollowing time slot (t2) a second signal S_(t2) that contains X₂ and amessage for UE₁ (denoted X₃, which may be identical to X₁ or a newmessage that is different than X₁).

Step 3: The NN receives the NACK transmitted by UE₂. The NN alsoreceives the acknowledgement sent by UE₁.

Step 4: The NN informs UE₁ of UE₂'s decoding status, which informs UE₁that in time slot t2 NN will transmit a signal (S_(t2)) comprising themessage X₃ for UE₁ and message X₂ (i.e., the message for UE₂ that UE₂was not able to decode). The NN may also inform UE₂ of UE₁'s decodingstatus. Assuming UE₁ transmits an ACK (positive acknowledgement), the NNwill assume that in time slot t2 UE₁ will use a non-SIC decoder todecode message X₃ (e.g., NN will assume that in time slot t2 both UE₁and UE₂ will use the same decoders or decoders that have the sametiming) and the NN will inform UE, such that the signaling procedure ofthe UEs are synchronized. This can be performed by, e.g., NN sending toUE₂ information (e.g., an index) identifying a synchronization protocol(e.g., information indicating whether UE₂ need to employ a sleepingperiod 401 such that after UE₂ finishes its decoding process it waitsfor a certain amount of time before transmitting an acknowledgement).

Step 5: UE₁, after receiving the information about the message decodingstatus of the UE₂, selects an appropriate decoding scheme, i.e., SIC orconventional receiver, in the next time slot and adapts itssynchronization protocol accordingly. Also, UE₂, depending on theselected decoding scheme of the UE₁, uses the received synchronizationindex to synchronize its transmit/receive timing.

Step 6: in time slot t2 NN transmits S_(t2). Also, as described above,depending on the UEs message decoding status, the NN adapts thetransmission parameters, e.g., rate and/or power, of the UEs. Forinstance, the power used to transmit message X₂ in time slot t2 may begreater than the power that was used to transmit message X₂ in time slot1 and/or the rate used to transmit message X₃ in time slot t2 may begreater than the rate used to transmit message X₁ in time slot t1 (i.e.,message X₃ contains more information than message X₁).

Step 7: UE₁ receives signal Y₁(t2) corresponding to S_(t2) and UE₁ usesthe selected decoding scheme to decode X₃ from Y₁(t2), For example,assuming that UE₁ was able to decode message X₂ from Y₁(t1), then whenUE₁ receives Y₁(t2) in time slot t2, UE₁ can remove X₂ from Y₁(t2) andthen use a non-SIC receiver to decode message X₃ from the residual (seeblock 404 in FIG. 4).

The effectiveness of the proposed scheme depends on the channelcoefficients remaining generally constant during the retransmissionrounds, so that knowing X₂, the received interference term h₁√{squareroot over (P₂)}X₂ can be removed by UE₁ from the received signal Y₁(t2).As a result, the proposed scheme is most useful instationary/slow-moving networks which, due to the high CSI acquisitionand scheduling overhead of NOMA, are of most interest in NOMA-basedsystems.

The method above is described using Chase Combining HARQ, where the samesignal is sent to UE₂ in different retransmission rounds; however, asdescribed above, the same setup is well applicable for, e.g.,incremental redundancy HARQ, where different redundancy signals are sentin different retransmission rounds. There, decoding the message of theUE₂, the UE₁ knows the redundancy signals sent for the UE₂ in nextretransmissions and, as a result, can remove their correspondingreceived signals. Also, while the methods described above are describedfor the simplest case where, while the UE cannot correctly decode itsmessage in round 1, the same procedure is applicable in any round ofretransmission. The method described above use a scenario in which astrong UE is paired with a weak UE; this is motivated by the fact thatthe highest gain of NOMA is observed when two UEs with different channelqualities are paired. Nevertheless, the same setup is applicable for anypair of UEs.

FIG. 5 is a flow chart illustrating a process 500, according to anembodiment, that is performed by the network node. Process 500 may beginin step s502 where the network node transmits, during a first time slot(t1), a first superimposed signal (S(t1)) comprising a first message fora first (e.g., UE 101 cir UE 102) UE and a second message for a secondUE (e.g., UE 101 or UE 102). In step s504, the network node receives amessage transmitted by the first UE indicating that the first UE wasunable to decode the first message. In step s506, after receiving themessage transmitted by the first UE indicating that the first UE wasunable to decode the first message, the network node provides to thesecond UE a message indicating that the first UE was unable to decodethe first message.

In some embodiments, the process may further include, after receivingthe message transmitted by the first UE indicating that the first UE wasunable to decode the, first message, the network node transmitting,during a second time slot (t2), a second superimposed signal (S(t2))comprising the first message for the first UE and a third message forthe second UE. Also, the process may further include the network nodetransmitting, during a third time slot, a third superimposed signalcomprising a third message for the first UE and a fourth message for thesecond UE; the network node receiving a message transmitted by thesecond UE indicating that the second UE was unable to decode the fourthmessage for the second UE included in the third superimposed signal; andafter receiving the message transmitted by the second UF indicating thatthe second UE was unable to decode the fourth message, the network nodeproviding to the first UE a message indicating that the network nodewill retransmit in a fourth time slot at least a portion of the fourthmessage. The process may further include, after receiving the messagetransmitted by the second UE indicating that the second UE was unable todecode the fourth message, the network node transmitting, during thefourth time slot, a fourth superimposed signal comprising the fourthmessage for the second UE and a fifth message for the first UE.

FIG. 6 is a flow chart illustrating a process 600 according to anembodiment. Process 600 may begin in step s602 where a first UE (e.g.,UE 101 or UE 102) receives, during a first time slot, a firstsuperimposed signal based on a superimposed signal transmitted by thenetwork node, the first superimposed signal comprising a first messagefor the first UE and a second message for a second UE. In step s604,after receiving the first superimposed signal, the first UE obtainsinformation that indicates that the second UE was unable to decode thesecond message and uses the obtained information to decode a thirdmessage for the first UE that is contained in a second superimposedsignal received by the first UE. In some embodiments, the UE obtains theinformation by receiving a message transmitted by the network node,wherein the message indicates that the second UE was unable to decodethe second message. In another embodiment, the first UE obtains theinformation comprises receiving a negative acknowledgement transmittedby the second UE.

In some embodiments, the first UF is a weak UE (e.g., UE₂) and furtherperforms steps s606-s610. In step s606, the first UIP,: decodes thefirst message from the first superimposed signal, uses the obtainedfirst message and the first superimposed signal to generate a residualsignal comprising the second message for the second UE, and buffers theresidual signal. In step s608 the first UE receives, during a secondtime slot, a second superimposed signal, the second superimposed signalcomprising a third message for the first UE and at least a portion ofthe second message. In step s610, as a result of receiving theinformation indicating that the second UE was not able to decode thesecond message, the first UE: i) uses the buffered residual signal andthe received second superimposed signal to obtain the second message (orportion thereof in case of incremental HARQ) and ii) uses the obtainedsecond message (or portion thereof) and the received second superimposedsignal to obtain the third message from the second superimposed signal.

In other embodiments, the first UE is a strong UE (e.g., UE₁) andfurther performs steps s612-s616. In step s612, the first UE obtains thesecond message from the first superimposed signal. In step s614, thefirst UE receives, during a second time slot, a second superimposedsignal, the second superimposed signal comprising a third message forthe first UE and at least a portion of the second message. In step s616,as a result of receiving the information indicating that the second UEwas not able to decode the second message, the first UE removes the atleast a portion of the second message from the second superimposedsignal (e.g., removes h₁√{square root over (P₂)}X₂ from the secondsuperimposed signal) to produce a residual signal (e.g., h₁√{square rootover (P₁)}X₃) and then obtains the third message (X₃) from the residualsignal using, for example, a conventional non-SIC decoder.

FIG. 7 is a block diagram of a network node 700, according to someembodiments for performing methods disclosed herein. As shown in FIG. 7,network node 700 may comprise: processing circuitry (PC) 702, which mayinclude one or more processors (P) (e.g., a general purposemicroprocessor and/or one or more other processors, such as anapplication specific integrated circuit (ASIC), field-programmable gatearrays (FPGAs), and the like); a network interface 748 comprising atransmitter (Tx) 745 and a receiver (Rx) 747 for enabling network node700 to transmit data to and receive data from other nodes connected to anetwork 110 (e.g., an Internet Protocol (IP) network) to which networkinterface 748 is connected; circuitry 703 (e.g., radio transceivercircuitry comprising an Rx 705 and a Tx 706) coupled to an antennasystem 704 for wireless communication with UEs); and a local storageunit (a.k.a., “data storage system”) 708, which may include one or morenon-volatile storage devices and/or one or more volatile storagedevices. In embodiments where PC 702 includes a programmable processor,a computer program product (CPP) 741 may be provided. CPP 741 includes acomputer readable medium (CRM) 742 storing a computer program (CP) 743comprising computer readable instructions (CRI) 744. CRM 742 may be anon-transitory computer readable medium, such as, magnetic media (e.g.,a hard disk), optical media, memory devices (e.g., random access memory,flash memory), and the like. In some embodiments, the CRI 744 ofcomputer program 743 is configured such that when executed by PC 702,the CRI causes network node 700 to perform steps described herein (e.g.,steps described herein with reference to the flow charts). In otherembodiments, network node 700 may be configured to perform stepsdescribed herein without the need for code. That is, for example, PC 702may consist merely of one or more ASICs. Hence, the features of theembodiments described herein may be implemented in hardware and/orsoftware.

FIG. 8 is a diagram showing functional units of network node 105according to one embodiment. In the embodiment shown, network node 105includes: a transmission unit 802 for employing a transmitter totransmit a first superimposed signal; a receiver unit 804 for employinga receiver to obtain a message transmitted by the first UE (e.g., UE 101or UE 102) indicating that the first UE was unable to decode the firstmessage; and a providing unit 806 for providing to the second UE amessage indicating that the first UE was unable to decode the firstmessage.

FIG. 9 is a block diagram of a UE (e.g. UP 101 or UE 102), according tosome embodiments. As shown in FIG. 9, the UE may comprise: processingcircuitry (PC) 902, which may include one or more processors (P) 955(e.g., a general purpose microprocessor and/or one or more otherprocessors, such as an application specific integrated circuit (ASIC),field-programmable gate arrays (FPGAs), and the like); circuitry 903(e.g., radio transceiver circuitry comprising an Rx 905 and a Tx 906)coupled to an antenna system 904 for wireless communication); and alocal storage unit (a.k.a., “data storage system”) 908, which mayinclude one or more non-volatile storage devices and/or one or morevolatile storage devices. in embodiments where PC 902 includes aprogrammable processor, a computer program product (CPP) 941 may beprovided. CPP 941 includes a computer readable medium (CRM) 942 storinga computer program (CP) 943 comprising computer readable instructions(CRI) 944. CRM 942 may be a non-transitory computer readable medium,such as, magnetic media (e.g., a hard disk), optical media, memorydevices (e.g., random access memory, flash memory), and the like. Insome embodiments, the CR1 944 of computer program 943 is configured suchthat when executed by PC 902, the CRI causes the UE to perform stepsdescribed herein (e.g., steps described herein with reference to theflow charts). In other embodiments, the UE may be configured to performsteps described herein without the need for code. That is, for example,PC 902 may consist merely of one or more ASICs. Hence, the features ofthe embodiments described herein may be implemented in hardware and/orsoftware.

FIG. 10 is a diagram showing functional units of a UE (e.g., UE 101 orUE 102) according to one embodiment. In the embodiment shown, the UEincludes: a receiving unit 1002 for employing a receiver to obtain afirst superimposed signal based on a superimposed signal transmitted bythe network node, an information obtaining unit 1004 for obtaininginformation indicating that the second UE was unable to decode thesecond message from the first superimposed signal, and a decoding unit1006 for using the obtained information to decode a third message forthe first UE that is contained in a second superimposed signal receivedby the first UE.

FIG. 11 is a diagram showing functional units of UE 101 according to oneembodiment. In the embodiment shown, UE 101 includes a first decodingunit 1102 for obtaining first and second messages from a firstsuperimposed signal, wherein the first message is for the first UE andthe second message is for a second UE (e.g., UE 102). UE 101 furtherincludes an information obtaining unit 1104 for obtaining informationthat indicates that the second UE was unable to decode the secondmessage from the first superimposed signal. UE 101 further includes aprocessing unit 1106 configured such that, as a result of the obtainingunit obtaining information that indicates that the second UE was unableto decode the second message from the first superimposed signal, theprocessing unit 1106 employs a second decoding unit 1108 to obtain athird message from a second superimposed signal comprising the thirdmessage and at least a portion of the second message. The seconddecoding unit 1108 is different than the first decoding unit 1102. Thesecond decoding unit 1108 is configured to use the second messageobtained via the first decoding unit 1102 to remove the at least aportion of the second message from the second superimposed signal,thereby producing a residual signal. And the second decoding unit 1108is configured to obtain the third message from the residual signal.

While various embodiments are described herein, it should he understoodthat they have been presented by way of example only, and notlimitation. Thus, the breadth and scope of this disclosure should riotbe limited by airy of the above-described exemplary embodiments.Moreover, any combination of the above-described elements in allpossible variations thereof is encompassed by the disclosure unlessotherwise indicated herein or otherwise clearly contradicted by context.

Additionally, while the processes described above and illustrated in thedrawings are shown as a sequence of steps, this was done solely for thesake of illustration. Accordingly, it is contemplated that some stepsmay be added, some steps may be omitted, the order of the steps may bere-arranged, and some steps may be performed in parallel.

1. A method performed by a network node serving a first user equipment(UE) and a second UE, the method comprising: the network nodetransmitting, during a first time slot, a first superimposed signalcomprising a first message for the first UE and a second message for thesecond UE; the network node receiving a message transmitted by the firstUE indicating that the first UE was unable to decode the first message;and after receiving the message transmitted by the first UE indicatingthat the first UE was unable to decode the first message, the networknode providing to the second UE a message indicating that the first UEwas unable to decode the first message, thereby enabling the second UEto select an appropriate decoding scheme to use in a subsequent timeslot.
 2. The method of claim 1, further comprising after receiving themessage transmitted by the first UE indicating that the first UE wasunable to decode the first message, the network node transmitting,during a second time slot, a second superimposed signal comprising thefirst message for the first UE and a third message for the second UE. 3.The method of claim 2, further comprising: the network nodetransmitting, during a third time slot, a third superimposed signalcomprising a third message for the first UE and a fourth message for thesecond UE; the network node receiving a message transmitted by thesecond UE indicating that the second UE was unable to decode the fourthmessage for the second UE included in the third superimposed signal; andafter receiving the message transmitted by the second UE indicating thatthe second UE was unable to decode the fourth message, the network nodeproviding to the first UE a message indicating that the network nodewill retransmit in a fourth time slot at least a portion of the fourthmessage.
 4. The method of claim 3, further comprising after receivingthe message transmitted by the second UE indicating that the second UEwas unable to decode the fourth message, the network node transmitting,during the fourth time slot, a fourth superimposed signal comprising thefourth message for the second UE and a fifth message for the first UE.5. A method performed by a first user equipment (UE) that is beingserved by a network node, the method comprising: the first UE receiving,during a first time slot, a first superimposed signal, the firstsuperimposed signal comprising a first message for the first UE and asecond message for a second UE being served by the network node; andafter receiving the first superimposed signal, the first UE obtainsinformation that indicates that the second UE was unable to decode thesecond message and uses the obtained information to decode a thirdmessage for the first UE that is contained in a second superimposedsignal received by the first UE.
 6. The method of claim 5, whereinobtaining the information comprises the first UE receiving a messagetransmitted by the network node, wherein the message indicates that thesecond UE was unable to decode the second message.
 7. The method ofclaim 5, wherein obtaining the information comprises the first UEreceiving a negative acknowledgement transmitted by the second UE. 8.The method of claim 5, further comprising: the first UE decoding thefirst superimposed signal to obtain from the first superimposed signalthe first message for the first UE; the first UE using the obtainedfirst message and the first superimposed signal to generate a residualsignal comprising the second message for the second UE; and the first UEbuffering the residual signal.
 9. The method of claim 8, furthercomprising: the first UE receiving, during a second time slot, a secondsuperimposed signal, the second superimposed signal comprising a thirdmessage for the first UE and at least a portion of the second message;and the first UE using the buffered residual signal and the receivedsecond superimposed signal to obtain said at least a portion of thesecond message.
 10. The method of claim 9, further comprising: the firstusing the obtained second message and the received second superimposedsignal to obtain the third message from the second superimposed signal.11. A network node, the network node being adapted to: transmit, duringa first time slot, a first superimposed signal comprising a firstmessage for the first UE and a second message for the second UE; receivea message transmitted by the first UE indicating that the first UE wasunable to decode the first message; and after receiving the messagetransmitted by the first UE indicating that the first UE was unable todecode the first message, provide to the second UE a message indicatingthat the first UE was unable to decode the first message, therebyenabling the second UE to select an appropriate decoding scheme to usein a subsequent time slot.
 12. (canceled)
 13. A first user equipment,the first user equipment (UE) being adapted to: receive, during a firsttime slot, a first superimposed signal, the first superimposed signalcomprising a first message for the first UE and a second message for asecond UE being served by the network node; after receiving the firstsuperimposed signal, obtain information indicating that the second UEwas unable to decode the second message; and use the obtainedinformation to decode a third message for the first UE that is containedin a second superimposed signal received by the first UE.
 14. The firstUE of claim 13, wherein obtaining the information comprises receiving amessage transmitted by the network node, wherein the message indicatesthat the second UE was unable to decode the second message.
 15. Thefirst UE of claim 13, wherein obtaining the information comprisesreceiving a negative acknowledgement transmitted by the second UE. 16.The first UE of claim 13, wherein the first UE is further adapted to:decode the first superimposed signal to obtain from the firstsuperimposed signal the first message for the first UE; use the obtainedfirst message and the first superimposed signal to generate a residualsignal comprising the second message for the second UE; and buffer theresidual signal.
 17. The first UE of claim 16, wherein the first UE isfurther adapted to: receive, during a second time slot, a secondsuperimposed signal, the second superimposed signal comprising a thirdmessage for the first UE and at least a portion of the second message;and use the buffered residual signal and the received secondsuperimposed signal to obtain said at least a portion of the secondmessage.
 18. The first UE of claim 17, wherein the first UE is furtheradapted to: use the obtained second message and the received secondsuperimposed signal to obtain the third message from the secondsuperimposed signal.
 19. (canceled)
 20. A computer program productcomprising a non-transitory computer readable medium storing a computerprogram comprising instructions which, when executed by processingcircuitry, causes the processing circuitry to carry out the method ofclaim
 1. 21. A computer program product comprising a non-transitorycomputer readable medium storing a computer program comprisinginstructions which, when executed by processing circuitry, causes theprocessing circuitry to carry out the method of claim
 5. 22. (canceled)